Mathematical Models for Minimizing Total Tardiness on Parallel Additive Manufacturing Machines

In this research we tackle the scheduling problem in additive manufacturing for unrelated parallel machines. Both nesting and aspects are considered. Parts have several alternative build orientations. The goal is to minimize total tardiness of parts. We propose a mixed-integer linear programming model which considers subproblem as 2D bin-packing problem, well simplifies 1D problem. computational efficiency properties proposed models investigated by numerical experiments. Results show that optimization significantly increases complexity only simple instances solved optimally, whereas makespan variant able solve all testing instances. Using simplification allows solving more optimality, but with risk obtaining nesting-infeasibility. also observed compromise between objectives, originates from dilemma “packing parts benefit common machine setup/recoating time” or less maintain flexibility handling distributed duedates”.